Search results for "Decoding methods"
showing 10 items of 54 documents
Massively Parallel ANS Decoding on GPUs
2019
In recent years, graphics processors have enabled significant advances in the fields of big data and streamed deep learning. In order to keep control of rapidly growing amounts of data and to achieve sufficient throughput rates, compression features are a key part of many applications including popular deep learning pipelines. However, as most of the respective APIs rely on CPU-based preprocessing for decoding, data decompression frequently becomes a bottleneck in accelerated compute systems. This establishes the need for efficient GPU-based solutions for decompression. Asymmetric numeral systems (ANS) represent a modern approach to entropy coding, combining superior compression results wit…
Capturing the musical brain with Lasso: Dynamic decoding of musical features from fMRI data.
2013
We investigated neural correlates of musical feature processing with a decoding approach. To this end, we used a method that combines computational extraction of musical features with regularized multiple regression (LASSO). Optimal model parameters were determined by maximizing the decoding accuracy using a leave-one-out cross-validation scheme. The method was applied to functional magnetic resonance imaging (fMRI) data that were collected using a naturalistic paradigm, in which participants' brain responses were recorded while they were continuously listening to pieces of real music. The dependent variables comprised musical feature time series that were computationally extracted from the…
Identifying musical pieces from fMRI data using encoding and decoding models.
2018
AbstractEncoding models can reveal and decode neural representations in the visual and semantic domains. However, a thorough understanding of how distributed information in auditory cortices and temporal evolution of music contribute to model performance is still lacking in the musical domain. We measured fMRI responses during naturalistic music listening and constructed a two-stage approach that first mapped musical features in auditory cortices and then decoded novel musical pieces. We then probed the influence of stimuli duration (number of time points) and spatial extent (number of voxels) on decoding accuracy. Our approach revealed a linear increase in accuracy with duration and a poin…
Design of efficient codes for the AWGN channel based on decomposable binary lattices
1998
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.
Modeling Multi-label Recurrence in Data Streams
2019
Most of the existing data stream algorithms assume a single label as the target variable. However, in many applications, each observation is assigned to several labels with latent dependencies among them, which their target function may change over time. Classification of such non-stationary multi-label streaming data with the consideration of dependencies among labels and potential drifts is a challenging task. The few existing studies mostly cope with drifts implicitly, and all learn models on the original label space, which requires a lot of time and memory. None of them consider recurrent drifts in multi-label streams and particularly drifts and recurrences visible in a latent label spa…
On the Trustworthiness of Error-Correcting Codes
2007
The use of error-correcting codes protects data against accidental or intentional errors, but to what extent can a decoded message be trusted? To answer this question, one has to take the role of the receiver. First, the maximum number of errors Lambda acceptable for decoding is fixed. With the weight distribution, the probability of false decoding can be calculated, conditioned on such a Lambda-bounded strategy. This probability is a monotonously increasing function in the channel error probability p and in the maximum number of accepted errors Lambda. Therefore, pure error detection is more trustworthy than error correction. Moreover, for sufficiently small p, codes with the lexicographic…
Analog joint source-channel Multiple Description coding scheme over AWGN parallel channels
2011
We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN channels. The outputs of these channels have each a separated receiver, whereas a third receiver has both outputs available. At the transmitter side, a pair of bandwidth-reduction analog mappings are used for joint source-channel coding. The presented scheme has the inherent advantage over digital MD schemes based on separation, that coding and decoding can be performed by using a single-letter (or symbol), a strategy that is very suitable for applications where latency originated by the digital compression and th…
New super-orthogonal space-time trellis codes using differential M-PSK for noncoherent mobile communication systems with two transmit antennas
2010
Published version of an article in the journal: Annals of Telecommunications-Annales Des Telecommunications. Also available from the publisher at: http://dx.doi.org/10.1007/s12243-010-0191-1 In this paper, we develop super-orthogonal space-time trellis codes (SOSTTCs) using differential binary phase-shift keying, quadriphase-shift keying and eight-phase shift keying for noncoherent communication systems with two transmit antennas without channel state information at the receiver. Based on a differential encoding scheme proposed by Tarokh and Jafarkhani, we propose a new decoding algorithm with reduced decoding complexity. To evaluate the performance of the SOSTTCs by way of computer simulat…
Throughput and delay analysis of HARQ with code combining over double Rayleigh fading channels
2018
This paper proposes the use of hybrid automatic repeat request (HARQ) with code combining (HARQ-CC) to offer reliable communications over double Rayleigh channels. The double Rayleigh fading channel is of particular interest to vehicleto-vehicle communication systems as well as amplify-and-forward relaying and keyhole channels. This paper studies the performance of HARQ-CC over double Rayleigh channels from an information theoretic perspective. Analytical approximations are derived for the ϵ-outage capacity, the average number of transmissions, and the throughput of HARQ-CC. Moreover, we evaluate the delay experienced by Poisson-arriving packets for HARQ-CC. We provide analytical expression…
Pragmatic languages with universal grammars
2012
Abstract This paper constructs the equilibrium for a specific code that can be seen as a “universal grammar” in a class of common interest Sender–Receiver games where players communicate through a noisy channel. We propose a Senderʼs signaling strategy which does not depend on either the game payoffs or the initial probability distribution. The Receiverʼs strategy partitions the set of possible sequences into subsets, with a single action assignment to each of them. The Senderʼs signaling strategy is a Nash equilibrium, i.e. when the Receiver responds best to the Senderʼs strategy, the Sender has no incentive to deviate. An example shows that a tie-breaking decoding is crucial for the block…